Constructions and obstructions for extremal polytopes

نویسنده

  • Raman Sanyal
چکیده

In the fall of 2001, I was finishing my computer science undergrad studies and Martin Skutella suggested that I take the course " Linear optimization " , a course offered to beginning math grad students and taught by Prof. Günter Ziegler. Following his advice, my fellow student Roman Wagner and I took the course, and failed badly. We lacked the necessary linear algebra and so the teaching assistant had a hard time understanding our " solutions " to the exercises. However, I liked the little that I understood and after the next semester break, which I spent with a linear algebra book, I restarted the ADM-lecture-cycle, this time with " Graph and network algorithms " and more computer scientists: Moritz Hilger and Oliver Wirjadi joined the team. We had a great time spending afternoons at the " beach " solving the exercises. But the best of all was our tutor Vanessa Kääb: In three months from now we will get married and in two more months we will have our first child – ain't that great! The teaching assistant was Frank Lutz who offered me the job as a tutor for the linear optimization course – not a bad setup as I did not have to do the exercises again. He also encouraged me to attend the " Discrete Geometry " course in the 2004 summer term, also taught by Günter. In the following semester break I started working on my diploma thesis under Günter's supervision. I got a desk in the workgroup and I met lots of people to talk about math, including Jakob Uszkoreit, someone who can listen to more math than I'm able to tell. I did a decent job in my thesis and Günter offered me a PhD position, first on his Leibnitz grant and later in the research training group " Methods for Discrete Structures ". That was in October 2005. Now it is May 2008 and the end of the journey. I had a wonderful time. Günter taught me how to do research, how to " write stuff up, " and how to give talks. I enjoyed the frequent morning coffees with him in the " Molotov Depot " (it opens up at 7:20 am, weekends a little later) and I appreciated the fact that he had always time for yet another (stupid) question. I benefited not only from what he is doing in …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Polytopes: Extremal Constructions and f -Vector Shapes

These lecture notes treat some current aspects of two closely interrelated topics from the theory of convex polytopes: the shapes of f -vectors, and extremal constructions. The study of f -vectors has had huge successes in the last forty years. The most fundamental one is undoubtedly the “g-theorem,” conjectured by McMullen in 1971 and proved by Billera & Lee and Stanley in 1980, which characte...

متن کامل

Non-projectability of Polytope Skeleta

We investigate necessary conditions for the existence of projections of polytopes that preserve full k-skeleta. More precisely, given the combinatorics of a polytope and the dimension e of the target space, what are obstructions to the existence of a geometric realization of a polytope with the given combinatorial type such that a linear projection to e-space strictly preserves the k-skeleton. ...

متن کامل

On the Geometry of random {−1, 1}-polytopes

Random {−1, 1}-polytopes demonstrate extremal behavior with respect to many geometric characteristics. We illustrate this by showing that the combinatorial dimension, entropy and Gelfand numbers of these polytopes are extremal at every scale of their arguments.

متن کامل

Extremal Edge Polytopes

The edge polytope of a finite graph G is the convex hull of the columns of its vertex-edge incidence matrix. We study extremal problems for this class of polytopes. For k ∈ {2, 3, 5}, we determine the maximal number of vertices of kneighborly edge polytopes up to a sublinear term. We also construct a family of edge polytopes with exponentially-many facets.

متن کامل

Random half-integral polytopes

We show that half-integral polytopes obtained as the convex hull of a random set of half-integral points of the 0/1 cube have rank as high as Ω(log n/ log log n) with positive probability — even if the size of the set relative to the total number of half-integral points of the cube tends to 0. The high rank is due to certain obstructions. We determine the exact threshold number, when these obst...

متن کامل

Geometry of random (-1/+1)-polytopes A survey of recent results on random {−1, 1}-polytopes in Asymptotic Convex Analysis

Random {−1, 1}-polytopes demonstrate extremal behavior with respect to many geometric characteristics.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008